Multiwinner Rules on Paths From k-Borda to Chamberlin-Courant
نویسندگان
چکیده
The classical multiwinner rules are designed for particular purposes. For example, variants of kBorda are used to find k best competitors in judging contests while the Chamberlin-Courant rule is used to select a diverse set of k products. These rules represent two extremes of the multiwinner world. At times, however, one might need to find an appropriate trade-off between these two extremes. We explore continuous transitions from k-Borda to Chamberlin-Courant and study intermediate rules.
منابع مشابه
Complexity of Shift Bribery in Committee Elections
We study the (parameterized) complexity of SHIFT BRIBERY for multiwinner voting rules. We focus on the SNTV, Bloc, k-Borda, and Chamberlin-Courant, as well as on approximate variants of the Chamberlin-Courant rule, since the original rule is NP-hard to compute. We show that SHIFT BRIBERY tends to be significantly harder in the multiwinner setting than in the single-winner one by showing setting...
متن کاملProperties of multiwinner voting rules
The goal of this paper is to propose and study properties of multiwinner voting rules (with a particular focus on rules based in some way on single-winner scoring rules). We consider, e.g., SNTV, Bloc, k-Borda, STV, and several variants of Chamberlin–Courant’s and Monroe’s rules, identify two natural approaches to defining multiwinner rules, and show that many of our rules can be captured by on...
متن کاملWhat Do Multiwinner Voting Rules Do? An Experiment Over the Two-Dimensional Euclidean Domain
We visualize aggregate outputs of popular multiwinner voting rules—SNTV, STV, Bloc, k-Borda, Monroe, Chamberlin– Courant, and PAV—for elections generated according to the two-dimensional Euclidean model. We consider three applications of multiwinner voting, namely, parliamentary elections, portfolio/movie selection, and shortlisting, and use our results to understand which of our rules seem to ...
متن کاملProportional Representation in Vote Streams
We consider elections where the voters come one at a time, in a streaming fashion, and devise space-efficient algorithms which identify an approximate winning committee with respect to common multiwinner proportional representation voting rules; specifically, we consider the Approval-based and the Borda-based variants of both the Chamberlin– Courant rule and the Monroe rule. We complement our a...
متن کاملProportional Representation as Resource Allocation: Approximability Results
We model Monroe’s and Chamberlin and Courant’s multiwinner voting systems as a certain resource allocation problem. We show that for many restricted variants of this problem, under standard complexity-theoretic assumptions there are no constant-factor approximation algorithms. Yet, we also show cases where good approximation algorithms exist (these variants correspond to optimizing total voter ...
متن کامل